Discrete phase-space approach to mutually orthogonal Latin squares
نویسندگان
چکیده
Abstract. We show there is a natural connection between Latin squares and commutative sets of monomials defining geometric structures in finite phase-space of prime power dimensions. A complete set of such monomials defines a mutually unbiased basis (MUB) and may be associated with a complete set of mutually orthogonal Latin squares (MOLS). We translate some possible operations on the monomial sets into isomorphisms of Latin squares, and find a general form of permutations that map between Latin squares corresponding to unitarily equivalent mutually unbiased sets.
منابع مشابه
Concerning the number of mutually orthogonal latin squares
Let N(n) denote the maximum number of mutually orthogonal Latin squares of order n. It is shown that for large n,
متن کاملSome Constructions of Mutually Orthogonal Latin Squares and Superimposed Codes
Superimposed codes is a special combinatorial structure that has many applications in information theory, data communication and cryptography. On the other hand, mutually orthogonal latin squares is a beautiful combinatorial object that has deep connection with design theory. In this paper, we draw a connection between these two structures. We give explicit construction of mutually orthogonal l...
متن کاملMaximal sets of mutually orthogonal Latin squares
Maximal sets of s mutually orthogonal Latin squares of order v are constructed for in nitely many new pairs (s; v). c © 1999 Published by Elsevier Science B.V. All rights reserved
متن کاملConstructing Mutually Unbiased Bases from Quantum Latin Squares
We introduce orthogonal quantum Latin squares, which restrict to traditional orthogonal Latin squares, and investigate their application in quantum information science. We use quantum Latin squares to build maximally entangled bases, and show how mutually unbiased maximally entangled bases can be constructed in square dimension from orthogonal quantum Latin squares. We also compare our construc...
متن کاملA graph-theoretic proof of the non-existence of self-orthogonal Latin squares of order 6
The non-existence of a pair of mutually orthogonal Latin squares of order six is a well-known result in the theory of combinatorial designs. It was conjectured by Euler in 1782 and was first proved by Tarry [4] in 1900 by means of an exhaustive enumeration of equivalence classes of Latin squares of order six. Various further proofs have since been given [1, 2, 3, 5], but these proofs generally ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014